On the maximum size of Erdős-Ko-Rado sets in $$H(2d+1, q^2)$$
نویسندگان
چکیده
Erdős-Ko-Rado sets in finite classical polar spaces are sets of generators that intersect pairwise non-trivially. We improve the known upper bound for Erdős-Ko-Rado sets in H(2d + 1, q) for d > 2 and d even from approximately q +d to q 2+1.
منابع مشابه
Theorems of Erdos-Ko-Rado type in polar spaces
We consider Erdős-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erdős-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+ 1, q) with n ≥ 2.
متن کاملCross-Intersecting Erdős-Ko-Rado Sets in Finite Classical Polar Spaces
A cross-intersecting Erdős-Ko-Rado set of generators of a finite classical polar space is a pair (Y,Z) of sets of generators such that all y ∈ Y and z ∈ Z intersect in at least a point. We provide upper bounds on |Y | · |Z| and classify the crossintersecting Erdős-Ko-Rado sets of maximum size with respect to |Y | · |Z| for all polar spaces except some Hermitian polar spaces.
متن کاملErdos-Ko-Rado in Random Hypergraphs
Let 3 ≤ k < n/2. We prove the analogue of the Erdős-Ko-Rado theorem for the random k-uniform hypergraph Gk(n, p) when k < (n/2)1/3; that is, we show that with probability tending to 1 as n → ∞, the maximum size of an intersecting subfamily of Gk(n, p) is the size of a maximum trivial family. The analogue of the Erdős-Ko-Rado theorem does not hold for all p when k À n1/3. We give quite precise r...
متن کاملThe minimum number of disjoint pairs in set systems and related problems
Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdős–Ko–Rado from 1961 says that, provided n ≥ 2k, any such system has size at most ( n−1 k−1 ) . A natural question, which was asked by Ahlswede in 1980, is how many disjoint pairs must appear in a set system of larger size. Except for the case k = 2, solved by Ahlswede ...
متن کاملIntersecting Families of Separated Sets
A set A ⊆ {1, 2, . . . , n} is said to be k-separated if, when considered on the circle, any two elements of A are separated by a gap of size at least k. We prove a conjecture due to Holroyd and Johnson [3],[4] that an analogue of the Erdős-Ko-Rado theorem holds for k-separated sets. In particular the result holds for the vertex-critical subgraph of the Kneser graph identified by Schrijver [7],...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 72 شماره
صفحات -
تاریخ انتشار 2014